Maximal Sets of Factors

نویسنده

  • C. A. Rodger
چکیده

In this paper, a survey is presented of results concerning maximal sets of factors in graphs. These factors at times satisfy additional structural constraints, such as being connected, or such as requiring each component of each factor to be isomorphic. Each set of factors occurs in some natural family of graphs, including complete graphs and complete multipartite graphs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some results on maximal open sets

In this paper, the notion of maximal m-open set is introduced and itsproperties are investigated. Some results about existence of maximal m-open setsare given. Moreover, the relations between maximal m-open sets in an m-spaceand maximal open sets in the corresponding generated topology are considered.Our results are supported by examples and counterexamples.

متن کامل

The Effect of Resistance Training with Two Maximum and Sub-maximal Intensities on Leukocytes and Blood Coagulation Factors in Non-Athlete Men: A Clinical Trial Study

  Background and Objectives: The effects of maximal and sub-maximal resistance exercise on leukocytes and coagulator factors is ambiguous. Therefore the purpose of the present study was to determine the effect of maximum and sub-maximal resistance training intensities on leukocytes and blood coagulation factors in non-athlete men. Materials and Methods: In this clinical trial study,...

متن کامل

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

متن کامل

Certain subalgebras of Lipschitz algebras of infinitely differentiable functions and their maximal ideal spaces

We study an interesting class of Banach function algebras of innitely dierentiable functions onperfect, compact plane sets. These algebras were introduced by Honary and Mahyar in 1999, calledLipschitz algebras of innitely dierentiable functions and denoted by Lip(X;M; ), where X is aperfect, compact plane set, M = fMng1n=0 is a sequence of positive numbers such that M0 = 1 and(m+n)!Mm+n ( m!Mm)...

متن کامل

Some results on fuzzy semi maximal filters in BL-algebras

In this paper, first, the concept of the fuzzy semi maximal filters in BL-algebras has been introduced, then several properties of  fuzzy semi maximal filters have been studied and  its relationship with other fuzzy filters including fuzzy  (positive)implicative  fuzzy filters and fuzzy fantastic  filters are investigated. In the following, using the level subsets  of fuzzy sets in a BL-algebra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004